Parallel interior-point solver for structured linear programs

نویسندگان

  • Jacek Gondzio
  • Robert Sarkissian
چکیده

Issues of implementation of an object-oriented library for parallel interior-point methods are addressed. The solver can easily exploit any special structure of the underlying optimization problem. In particular, it allows a nested embedding of structures and by this means very complicated real-life optimization problems can be modelled. The efficiency of the solver is illustrated on several problems arising in the optimization of networks. The sequential implementation outperforms the state-of-the-art commercial optimization software. The parallel implementation achieves speed-ups of about 3.1-3.9 on 4-processors parallel systems and speed-ups of about 10-12 on 16-processors parallel systems. Parallel Interior-Point Solver for Structured Linear Programs 1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel interior-point solver for structured quadratic programs: Application to financial planning problems

Issues of implementation of a library for parallel interior-point methods for quadratic programming are addressed. The solver can easily exploit any special structure of the underlying optimization problem. In particular, it allows a nested embedding of structures and by this means very complicated real-life optimization problems can be modeled. The efficiency of the solver is illustrated on se...

متن کامل

Reoptimization With the Primal-Dual Interior Point Method

Re-optimization techniques for an interior point method applied to solve a sequence of linear programming problems are discussed. Conditions are given for problem perturbations that can be absorbed in merely one Newton step. The analysis is performed for both short-step and long-step feasible path-following method. A practical procedure is then derived for an infeasible path-following method. I...

متن کامل

Warm Start and "-subgradients in Cutting Plane Scheme for Block-angular Linear Programs

This paper addresses the issues involved with an interior point-based decomposition applied to the solution of linear programs with a block-angular structure. Unlike classical decomposition schemes that use the simplex method to solve subproblems, the approach presented in this paper employs a primal-dual infeasible interior point method. The above-mentioned algorithm ooers a perfect measure of...

متن کامل

A Parallel Interior Point Method and Its Application to Facility Location Problems

We present a parallel interior point algorithm to solve block structured linear programs. This algorithm can solve block diagonal linear programs with both side constraints (common rows) and side variables (common columns). The performance of the algorithm is investigated on uncapacitated, capacitated and stochastic facility location problems. The facility location problems are formulated as mi...

متن کامل

Warm Start and ε-Subgradients in a Cutting Plane Scheme for Block-Angular Linear Programs

This paper addresses the issues involved with an interior point-based decomposition applied to the solution of linear programs with a block-angular structure. Unlike classical decomposition schemes that use the simplex method to solve subproblems, the approach presented in this paper employs a primal-dual infeasible interior point method. The abovementioned algorithm o ers perfect measure of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Program.

دوره 96  شماره 

صفحات  -

تاریخ انتشار 2003